Blar i SINTEF Open på forfatter "Wøhlk, Sanne"

Viser treff 1-2 av 2

    • A Lower Bound for the Node, Edge, and Arc Routing Problem 

      Bach, Lukas; Hasle, Geir; Wøhlk, Sanne (Journal article; Peer reviewed, 2013)
      The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004, although similar problems have been studied before. This problem, also called the Mixed Capacitated General Routing Problem ...

    • A Lower Bound for the Node, Edge, and ArcRouting Problem 

      Bach, Lukas; Hasle, Geir; Wøhlk, Sanne (Research report, 2011)
      The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004. They also proposed a memetic algorithm procedure and defined a set of test instances: the so-called CBMix benchmark. The NEARP ...